Bounding Iterated Function Systems via Convex Optimization
نویسنده
چکیده
We present an algorithm to construct a bounding polyhedron for an affine Iterated Function System (IFS). Our algorithm expresses the IFS-bounding problem as a set of linear constraints on a linear objective function, which can then be solved via standard techniques for linear convex optimization. As such, our algorithm is guaranteed to find the optimum recursively instantiable bounding volume, if it exists.
منابع مشابه
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the procedural model. Then we present a novel algorithm that expresses the IFS-bounding problem as a set of linear constraints on a linear objective function, which can then be solved via standard techniques for linear conve...
متن کاملApproximating continuous functions by iterated function systems and optimization problems
In this paper some new contractive operators on C([a, b]) of IFS type are built. Inverse problems are introduced and studied by convex optimization problems. A stability result and some optimality conditions are given. AMS Subject Classification: 28A80, 41A20
متن کاملGlobal Dynamic Optimization
My thesis focuses on global optimization of nonconvex integral objective functions subject to parameter dependent ordinary differential equations. In particular, efficient, deterministic algorithms are developed for solving problems with both linear and nonlinear dynamics embedded. The techniques utilized for each problem classification are unified by an underlying composition principle transfe...
متن کاملApproximating distribution functions by iterated function systems
In this small note an iterated function system on the space of distribution functions is built. The inverse problem is introduced and studied by convex optimization problems. Applications of this method to approximation of distribution functions and estimation are presented. Résumé. Dans cette petite note un système de fonction itéré sur l’espace de fonctions de repartition est construit. Le pr...
متن کاملOn bounding boxes of iterated function system attractors
Before rendering 2D or 3D fractals with iterated function systems, it is necessary to calculate the bounding extent of fractals. We develop a new algorithm to compute the bounding box which closely contains the entire attractor of an iterated function system. r 2003 Elsevier Science Ltd. All rights reserved.
متن کامل